0.09/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.11 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.11/0.32 % Computer : n031.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1200 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Tue Jul 13 11:45:29 EDT 2021 0.11/0.32 % CPUTime : 0.17/0.32 % Number of cores: 8 0.17/0.32 % Python version: Python 3.6.8 0.17/0.32 # Version: 2.6rc1-ho 0.17/0.32 # No SInE strategy applied 0.17/0.32 # Trying AutoSched0 for 59 seconds 0.17/0.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S003A 0.17/0.34 # and selection function PSelectNegativeLiterals. 0.17/0.34 # 0.17/0.34 # Preprocessing time : 0.013 s 0.17/0.34 # Presaturation interreduction done 0.17/0.34 0.17/0.34 # Proof found! 0.17/0.34 # SZS status Theorem 0.17/0.34 # SZS output start CNFRefutation 0.17/0.34 thf(cTHM559A_pme, conjecture, (((![X1:a]:cQ @ X1 @ X1&![X1:a, X2:a, X3:a]:((cQ @ X2 @ X3&cQ @ X1 @ X2)=>cQ @ X1 @ X3))&![X1:a, X2:a]:(cQ @ X1 @ X2=>cQ @ X2 @ X1))<=?[X4:a > a > $o]:![X1:a]:((X4 @ X1 @ X1&![X5:a]:(X4 @ X1 @ X5=>![X2:a]:(X4 @ X1 @ X2<=>cQ @ X5 @ X2)))&?[X3:a]:X4 @ X1 @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM559A_pme)). 0.17/0.34 thf(c_0_1, negated_conjecture, ~((?[X4:a > a > $o]:![X1:a]:((X4 @ X1 @ X1&![X5:a]:(X4 @ X1 @ X5=>![X2:a]:(X4 @ X1 @ X2<=>cQ @ X5 @ X2)))&?[X3:a]:X4 @ X1 @ X3)=>((![X1:a]:cQ @ X1 @ X1&![X1:a, X2:a, X3:a]:((cQ @ X2 @ X3&cQ @ X1 @ X2)=>cQ @ X1 @ X3))&![X1:a, X2:a]:(cQ @ X1 @ X2=>cQ @ X2 @ X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM559A_pme])])). 0.17/0.34 thf(c_0_2, negated_conjecture, ![X18:a, X19:a, X20:a]:(((epred1_0 @ X18 @ X18&((~epred1_0 @ X18 @ X20|cQ @ X19 @ X20|~epred1_0 @ X18 @ X19)&(~cQ @ X19 @ X20|epred1_0 @ X18 @ X20|~epred1_0 @ X18 @ X19)))&epred1_0 @ X18 @ (esk1_1 @ X18))&((((cQ @ esk6_0 @ esk7_0|(cQ @ esk4_0 @ esk5_0|~cQ @ esk2_0 @ esk2_0))&(~cQ @ esk7_0 @ esk6_0|(cQ @ esk4_0 @ esk5_0|~cQ @ esk2_0 @ esk2_0)))&((cQ @ esk6_0 @ esk7_0|(cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0))&(~cQ @ esk7_0 @ esk6_0|(cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0))))&((cQ @ esk6_0 @ esk7_0|(~cQ @ esk3_0 @ esk5_0|~cQ @ esk2_0 @ esk2_0))&(~cQ @ esk7_0 @ esk6_0|(~cQ @ esk3_0 @ esk5_0|~cQ @ esk2_0 @ esk2_0))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.17/0.34 thf(c_0_3, negated_conjecture, ![X1:a, X2:a, X3:a]:(cQ @ X3 @ X2|~epred1_0 @ X1 @ X2|~epred1_0 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_4, negated_conjecture, ![X1:a]:epred1_0 @ X1 @ X1, inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_5, negated_conjecture, ![X2:a, X1:a]:(cQ @ X1 @ X2|~epred1_0 @ X2 @ X1), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.17/0.34 thf(c_0_6, negated_conjecture, ![X3:a, X2:a, X1:a]:(epred1_0 @ X3 @ X2|~cQ @ X1 @ X2|~epred1_0 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_7, negated_conjecture, (cQ @ esk6_0 @ esk7_0|cQ @ esk3_0 @ esk4_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_8, negated_conjecture, ![X1:a]:cQ @ X1 @ X1, inference(spm,[status(thm)],[c_0_5, c_0_4])). 0.17/0.34 thf(c_0_9, negated_conjecture, (cQ @ esk6_0 @ esk7_0|cQ @ esk4_0 @ esk5_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_10, negated_conjecture, ![X1:a, X2:a]:(epred1_0 @ X1 @ X2|~cQ @ X1 @ X2), inference(spm,[status(thm)],[c_0_6, c_0_4])). 0.17/0.34 thf(c_0_11, negated_conjecture, (cQ @ esk6_0 @ esk7_0|cQ @ esk3_0 @ esk4_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])). 0.17/0.34 thf(c_0_12, negated_conjecture, (cQ @ esk6_0 @ esk7_0|cQ @ esk4_0 @ esk5_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_8])])). 0.17/0.34 thf(c_0_13, negated_conjecture, (cQ @ esk6_0 @ esk7_0|epred1_0 @ esk3_0 @ esk4_0), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.17/0.34 thf(c_0_14, negated_conjecture, (cQ @ esk6_0 @ esk7_0|epred1_0 @ esk4_0 @ esk5_0), inference(spm,[status(thm)],[c_0_10, c_0_12])). 0.17/0.34 thf(c_0_15, negated_conjecture, (cQ @ esk6_0 @ esk7_0|cQ @ esk4_0 @ esk3_0), inference(spm,[status(thm)],[c_0_5, c_0_13])). 0.17/0.34 thf(c_0_16, negated_conjecture, (cQ @ esk6_0 @ esk7_0|~cQ @ esk3_0 @ esk5_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_17, negated_conjecture, ![X1:a]:(cQ @ esk6_0 @ esk7_0|cQ @ X1 @ esk5_0|~epred1_0 @ esk4_0 @ X1), inference(spm,[status(thm)],[c_0_3, c_0_14])). 0.17/0.34 thf(c_0_18, negated_conjecture, (cQ @ esk6_0 @ esk7_0|epred1_0 @ esk4_0 @ esk3_0), inference(spm,[status(thm)],[c_0_10, c_0_15])). 0.17/0.34 thf(c_0_19, negated_conjecture, (cQ @ esk6_0 @ esk7_0|~cQ @ esk3_0 @ esk5_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_8])])). 0.17/0.34 thf(c_0_20, negated_conjecture, cQ @ esk6_0 @ esk7_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])). 0.17/0.34 thf(c_0_21, negated_conjecture, (cQ @ esk3_0 @ esk4_0|~cQ @ esk7_0 @ esk6_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_22, negated_conjecture, epred1_0 @ esk6_0 @ esk7_0, inference(spm,[status(thm)],[c_0_10, c_0_20])). 0.17/0.34 thf(c_0_23, negated_conjecture, (cQ @ esk4_0 @ esk5_0|~cQ @ esk7_0 @ esk6_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_24, negated_conjecture, (cQ @ esk3_0 @ esk4_0|~cQ @ esk7_0 @ esk6_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_8])])). 0.17/0.34 thf(c_0_25, negated_conjecture, cQ @ esk7_0 @ esk6_0, inference(spm,[status(thm)],[c_0_5, c_0_22])). 0.17/0.34 thf(c_0_26, negated_conjecture, (cQ @ esk4_0 @ esk5_0|~cQ @ esk7_0 @ esk6_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_8])])). 0.17/0.34 thf(c_0_27, negated_conjecture, cQ @ esk3_0 @ esk4_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25])])). 0.17/0.34 thf(c_0_28, negated_conjecture, cQ @ esk4_0 @ esk5_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_25])])). 0.17/0.34 thf(c_0_29, negated_conjecture, epred1_0 @ esk3_0 @ esk4_0, inference(spm,[status(thm)],[c_0_10, c_0_27])). 0.17/0.34 thf(c_0_30, negated_conjecture, (~cQ @ esk7_0 @ esk6_0|~cQ @ esk3_0 @ esk5_0|~cQ @ esk2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.34 thf(c_0_31, negated_conjecture, epred1_0 @ esk4_0 @ esk5_0, inference(spm,[status(thm)],[c_0_10, c_0_28])). 0.17/0.34 thf(c_0_32, negated_conjecture, cQ @ esk4_0 @ esk3_0, inference(spm,[status(thm)],[c_0_5, c_0_29])). 0.17/0.34 thf(c_0_33, negated_conjecture, (~cQ @ esk3_0 @ esk5_0|~cQ @ esk7_0 @ esk6_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_8])])). 0.17/0.34 thf(c_0_34, negated_conjecture, ![X1:a]:(cQ @ X1 @ esk5_0|~epred1_0 @ esk4_0 @ X1), inference(spm,[status(thm)],[c_0_3, c_0_31])). 0.17/0.34 thf(c_0_35, negated_conjecture, epred1_0 @ esk4_0 @ esk3_0, inference(spm,[status(thm)],[c_0_10, c_0_32])). 0.17/0.34 thf(c_0_36, negated_conjecture, ~cQ @ esk3_0 @ esk5_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_25])])). 0.17/0.34 thf(c_0_37, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36]), ['proof']). 0.17/0.34 # SZS output end CNFRefutation 0.17/0.34 # Proof object total steps : 38 0.17/0.34 # Proof object clause steps : 35 0.17/0.34 # Proof object formula steps : 3 0.17/0.34 # Proof object conjectures : 38 0.17/0.34 # Proof object clause conjectures : 35 0.17/0.34 # Proof object formula conjectures : 3 0.17/0.34 # Proof object initial clauses used : 9 0.17/0.34 # Proof object initial formulas used : 1 0.17/0.34 # Proof object generating inferences : 17 0.17/0.34 # Proof object simplifying inferences : 20 0.17/0.34 # Training examples: 0 positive, 0 negative 0.17/0.34 # Parsed axioms : 3 0.17/0.34 # Removed by relevancy pruning/SinE : 0 0.17/0.34 # Initial clauses : 12 0.17/0.34 # Removed in clause preprocessing : 2 0.17/0.34 # Initial clauses in saturation : 10 0.17/0.34 # Processed clauses : 110 0.17/0.34 # ...of these trivial : 5 0.17/0.34 # ...subsumed : 10 0.17/0.34 # ...remaining for further processing : 95 0.17/0.34 # Other redundant clauses eliminated : 0 0.17/0.34 # Clauses deleted for lack of memory : 0 0.17/0.34 # Backward-subsumed : 2 0.17/0.34 # Backward-rewritten : 25 0.17/0.34 # Generated clauses : 300 0.17/0.34 # ...of the previous two non-trivial : 220 0.17/0.34 # Contextual simplify-reflections : 1 0.17/0.34 # Paramodulations : 300 0.17/0.34 # Factorizations : 0 0.17/0.34 # NegExts : 0 0.17/0.34 # Equation resolutions : 0 0.17/0.34 # Propositional unsat checks : 0 0.17/0.34 # Propositional check models : 0 0.17/0.34 # Propositional check unsatisfiable : 0 0.17/0.34 # Propositional clauses : 0 0.17/0.34 # Propositional clauses after purity: 0 0.17/0.34 # Propositional unsat core size : 0 0.17/0.34 # Propositional preprocessing time : 0.000 0.17/0.34 # Propositional encoding time : 0.000 0.17/0.34 # Propositional solver time : 0.000 0.17/0.34 # Success case prop preproc time : 0.000 0.17/0.34 # Success case prop encoding time : 0.000 0.17/0.34 # Success case prop solver time : 0.000 0.17/0.34 # Current number of processed clauses : 58 0.17/0.34 # Positive orientable unit clauses : 36 0.17/0.34 # Positive unorientable unit clauses: 0 0.17/0.34 # Negative unit clauses : 1 0.17/0.34 # Non-unit-clauses : 21 0.17/0.34 # Current number of unprocessed clauses: 119 0.17/0.34 # ...number of literals in the above : 171 0.17/0.34 # Current number of archived formulas : 0 0.17/0.34 # Current number of archived clauses : 37 0.17/0.34 # Clause-clause subsumption calls (NU) : 290 0.17/0.34 # Rec. Clause-clause subsumption calls : 225 0.17/0.34 # Non-unit clause-clause subsumptions : 11 0.17/0.34 # Unit Clause-clause subsumption calls : 94 0.17/0.34 # Rewrite failures with RHS unbound : 0 0.17/0.34 # BW rewrite match attempts : 14 0.17/0.34 # BW rewrite match successes : 3 0.17/0.34 # Condensation attempts : 0 0.17/0.34 # Condensation successes : 0 0.17/0.34 # Termbank termtop insertions : 3271 0.17/0.34 0.17/0.34 # ------------------------------------------------- 0.17/0.34 # User time : 0.015 s 0.17/0.34 # System time : 0.003 s 0.17/0.34 # Total time : 0.018 s 0.17/0.34 # Maximum resident set size: 1648 pages 0.17/0.34 EOF